Transitive Anosov flows and pseudo-Anosov mapsFRIED, D.Topology (Oxford, Oxfordshire). 1983, Vol 22, Num 3, pp 299-303, issn 0040-9383Article

Algebraic flowsFRIEZE, A. M.North-Holland mathematics studies. 1984, Vol 95, pp 135-146, issn 0304-0208Article

A generating function proof of the commutativity of certain Hamiltonian isospectral flowsADAMS, M. R; HARNAD, J.letters in mathematical physics. 1988, Vol 16, Num 3, pp 269-272, issn 0377-9017Article

Polynomial flows in the planeBASS, H; MEISTERS, G.Advances in mathematics (New York, NY. 1965). 1985, Vol 55, Num 2, pp 173-208, issn 0001-8708Article

Markov families for Anosov flows with an involutive actionADACHI, T.Nagoya Mathematical Journal. 1986, Vol 104, pp 55-62, issn 0027-7630Article

RECURRENT AND POISSON STABLE FLOWSKNIGHT RA.1981; PROC. AM. MATH. SOC.; ISSN 0002-9939; USA; DA. 1981; VOL. 83; NO 1; PP. 49-53; BIBL. 9 REF.Article

NETWORK FLOW AND TESTING GRAPH CONNECTIVITY.EVEN S; TARJAN RE.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 4; PP. 507-518; BIBL. 11 REF.Article

A fast and simple algorithm for the maximum flow problemAHUJA, R. K; ORLIN, J. B.Operations research. 1989, Vol 37, Num 5, pp 748-759, issn 0030-364X, 12 p.Article

A generalized network flow model with application to power supply-demand problemsCHEN-CHING LIU; WU, F. F.Networks (New York, NY). 1984, Vol 14, Num 1, pp 117-139, issn 0028-3045Article

Approximate performance analysis of Web services flow using Stochastic Petri NetZHANGXI TAN; CHUANG LIN; HAO YIN et al.Lecture notes in computer science. 2004, pp 193-200, issn 0302-9743, isbn 3-540-23564-7, 8 p.Conference Paper

Efficient continuous-time dynamic network flow algorithmsFLEISCHER, L; TARDOS, E.Operations research letters. 1998, Vol 23, Num 3-5, pp 71-80, issn 0167-6377Article

A primal-dual algorithm for submodular flowsCUNNINGHAM, W. H; FRANK, A.Mathematics of operations research. 1985, Vol 10, Num 2, pp 251-262, issn 0364-765XArticle

Universally maximum flow with piecewise-constant capacitiesFLELSCHER, Lisa K.Networks (New York, NY). 2001, Vol 38, Num 3, pp 115-125, issn 0028-3045Article

A combinatorial approximation algorithm for concurrent flow problem and its applicationCHIOU, Suh-Wen.Computers & operations research. 2005, Vol 32, Num 4, pp 1007-1035, issn 0305-0548, 29 p.Article

On continuous network flowsORDA, A; ROM, R.Operations research letters. 1995, Vol 17, Num 1, pp 27-36, issn 0167-6377Article

AN O(!V!³) ALGORITHM FOR FINDING MAXIMUM FLOWS IN NETWORKSMALHOTRA VM; PRAMODH KUMAR M; MAHESHWARI SN et al.1978; INFORM. PROCESSG LETTERS; NLD; DA. 1978; VOL. 7; NO 6; PP. 277-278; BIBL. 7 REF.Article

Multi-terminal maximum flows in node-capacitated networksGRANOT, F; HASSIN, R.Discrete applied mathematics. 1986, Vol 13, Num 2-3, pp 157-163, issn 0166-218XArticle

Equivariant morse theory for flows and an application to the N-body problemPACELLA, F.Transactions of the American Mathematical Society. 1986, Vol 297, Num 1, pp 41-52, issn 0002-9947Article

A unified framework for primal-dual methods in minimum cost network flow problemsBERTSEKAS, D. P.Mathematical programming. 1985, Vol 32, Num 2, pp 125-145, issn 0025-5610Article

The Lorentz system does not have a polynomial flowCOOMES, B. A.Journal of differential equations (Print). 1989, Vol 82, Num 2, pp 386-407, issn 0022-0396Article

Lyapunov exponents for a stochastic analogue of the geodesic flowCARVERHILL, A. P; ELWORTHY, K. D.Transactions of the American Mathematical Society. 1986, Vol 295, Num 1, pp 85-105, issn 0002-9947Article

ON FULKERSON'S CONJECTURE ABOUT CONSISTENT LABELING PROCESSESMEGIDDO N; GALIL Z.1979; MATH. OPER. RES.; USA; DA. 1979; VOL. 4; NO 3; PP. 265-267; BIBL. 4 REF.Article

Rigidity of time changes for horocycle flowsRATNER, M.Acta mathematica. 1986, Vol 156, Num 1-2, pp 1-32, issn 0001-5962Article

Nonsingular holomorphic flowsCREW, R; FRIED, D.Topology (Oxford, Oxfordshire). 1986, Vol 25, Num 4, pp 471-473, issn 0040-9383Article

The zeta functions of Ruelle and Selberg. IFRIED, D.Annales scientifiques de l'Ecole normale supérieure. 1986, Vol 19, Num 4, pp 491-517, issn 0012-9593Article